A GenEO Domain Decomposition method for Saddle Point problems

نویسندگان

چکیده

We introduce an adaptive element-based domain decomposition (DD) method for solving saddle point problems defined as a block two by matrix. The algorithm does not require any knowledge of the constrained space. assume that all sub matrices are sparse and diagonal blocks spectrally equivalent to sum positive semi definite matrices. latter assumption enables design coarse space DD methods extends GenEO theory (Spillane et al., 2014) problems. Numerical results on three dimensional elasticity steel-rubber structures discretized finite element with continuous pressure shown up one billion degrees freedom.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain Decomposition Algorithms for Saddle Point Problems

In this paper, we introduce some domain decomposition methods for saddle point problems with or without a penalty term, such as the Stokes system and the mixed formulation of linear elasticity. We also consider more general nonsymmetric problems, such as the Oseen system, which are no longer saddle point problems but can be studied in the same abstract framework which we adopt. Several approach...

متن کامل

SADDLE POINT VARIATIONAL METHOD FOR DIRAC CONFINEMENT

A saddle point variational (SPV ) method was applied to the Dirac equation as an example of a fully relativistic equation with both negative and positive energy solutions. The effect of the negative energy states was mitigated by maximizing the energy with respect to a relevant parameter while at the same time minimizing it with respect to another parameter in the wave function. The Cornell pot...

متن کامل

An interior point method for constrained saddle point problems

We present an algorithm for the constrained saddle point problem with a convexconcave function L and convex sets with nonempty interior. The method consists of moving away from the current iterate by choosing certain perturbed vectors. The values of gradients of L at these vectors provide an appropriate direction. Bregman functions allow us to define a curve which starts at the current iterate ...

متن کامل

A note on GPIU method for generalized saddle point problems

In this note, the generalized parameterized inexact Uzawa method, abbreviated as the GPIU method, for solving the generalized saddle point problems with symmetric positive semi-definite (2,2) block is studied. The convergence of the method is established, which is an extension of the results obtained in a recent paper by Zhou and Zhang (2009) [22]. Crown Copyright 2013 Published by Elsevier Inc...

متن کامل

On generalized SSOR-like iteration method for saddle point problems

In this paper, we study the iterative algorithms for saddle point problems(SPP). We present a new symmetric successive over-relaxation method with three parameters, which is the extension of the SSOR iteration method. Under some suitable conditions, we give the convergence results. Numerical examples further confirm the correctness of the theory and the effectiveness of the method. Key–Words: i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Comptes rendus

سال: 2023

ISSN: ['1873-7234']

DOI: https://doi.org/10.5802/crmeca.175